Lagrangian Relaxation for the Multiple Constrained Robust Shortest Path Problem
نویسندگان
چکیده
منابع مشابه
The Lagrangian Relaxation Method for the Shortest Path Problem Considering Transportation Plans and Budgetary Constraint
In this paper, a constrained shortest path problem (CSP) in a network is investigated, in which some special plans for each link with corresponding pre-determined costs as well as reduction values in the link travel time are considered. The purpose is to find a path and selecting the best plans on its links, to improve the travel time as most as possible, while the costs of conducting plans do ...
متن کاملLagrangian relaxation and enumeration for solving constrained shortest-path problems
The constrained shortest-path problem (CSPP) generalizes the standard shortest-path problem by adding one or more path-weight side constraints. We present a new algorithm for CSPP that Lagrangianizes those constraints, optimizes the resulting Lagrangian function, identifies a feasible solution, and then closes any optimality gap by enumerating nearshortest paths, measured with respect to the La...
متن کاملThe Multiple Choice Elementary Constrained Shortest Path Problem
This paper considers a variation of the Elementary Constrained Shortest Path Problem in which nodes are separated into subsets and a feasible path through the network may visit at most one node from each subset. We refer to this problem as the Multiple Choice Elementary Constrained Shortest Path Problem (MC-ECSPP). The MC-ECSPP arises as a subproblem in branch-and-price approaches for variation...
متن کاملMemory-Constrained Algorithms for Shortest Path Problem
We present an algorithm computing a shortest path between to vertices in a square grid graph with edge weights that uses memory less than linear in the number of vertices (apart from that for storing in the input). For any ε > 0, our algorithm uses a work space of O(n) words and runs in O(n) time.
متن کاملShorter Path Constraints for the Resource Constrained Shortest Path Problem
Recently, new cost-based filtering algorithms for shorter-path constraints have been developed. However, so far only the theoretical properties of shorter-path constraint filtering have been studied. We provide the first extensive experimental evaluation of the new algorithms in the context of the resource constrained shortest path problem. We show how reasoning about path-substructures in comb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2019
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2019/3987278